Scheduling Real-Time Components Using Jitter-Constrained Streams.
نویسندگان
چکیده
منابع مشابه
Real-Time Control Design for Flexible Scheduling using Jitter Margin
Real-time control algorithms are designed based on the characteristics of the controlled plants and they require good performance without delays. However, digital control implementation typically introduces delays and jitters due to insufficient CPU processing power and the limitations of the real-time scheduling method used. This can degrade the system performance or even make it unstable. In ...
متن کاملOn the Quantitative Specification of Jitter Constrained Periodic Streams
An increasing number of application systems can be characterized by their requirement to process sequences of events in real-time. These sequences are principally of constant rate, but may vary within given limits. Hence, several parameter sets that seem to differ only slightly have been proposed to describe such sequences. This includes the parameter sets used in the Tenet Protocol Suite, in t...
متن کاملDelay Analysis for Real-time and Non Real-time Traffic Streams under a Priority Cell Scheduling
In this paper, we consider a priority cell scheduling in the following scenario. High-speed cell networks accommodate Constant Bit Rate (CBR) streams from real-time sources and Unspecified Bit Rate (UBR) streams from non real-time sources. The realtime traffic requires guarantees of its delay time. On the other hand, the non real-time traffic is relatively tolerable to its delay time. We obtain...
متن کاملPower Aware Scheduling for Resource Constrained Distributed Real-Time Systems
Power management has become popular in mobile computing as well as in server farms. Although a lot of work has been done to manage the energy consumption on uniprocessor real-time systems, there is less work done on their multicomputer counterparts. For a set of real-time tasks with precedence and resource constraints executing on a distributed system, we propose a dynamic slack management tech...
متن کاملEnd-to-end Window-Constrained Scheduling for Real-Time Communication
This paper extends our original work on window-constrained scheduling, to address the problem of meeting end-to-end service guarantees across a sequence of servers. We describe an algorithm, called Multi-hop Virtual Deadline Scheduling (MVDS), that attempts to minimize end-to-end window-constraint violations, while maximizing link utilization for a series of real-time streams. The challenge pos...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: The Journal of Object Technology
سال: 2007
ISSN: 1660-1769
DOI: 10.5381/jot.2007.6.11.a4